Development of Effective Estimation of Distribution Algorithms for Scheduling Problems

نویسندگان

  • Shih-Hsin Chen
  • Min-Chih Chen
  • Pei-Chann Chang
  • Qingfu Zhang
  • Yuh-Min Chen
چکیده

The purpose of this paper is to establish some guidelines for designing effective Estimation of Distribution Algorithms (EDAs). These guidelines aim at balancing intensification and diversification in EDAs. Most EDAs are able to maintain some important linkages among variables. This advantage, however, may lead to the premature convergence of EDAs since the probabilistic models no longer generating diversified solutions. In addition, overfitting might occure in EDAs. This paper proposes guidelines based on the convergence speed analysis of EDAs under different computational times for designing effective EDA algorithms. The major ideas are to increase the population diversity gradually and by hybridizing EDAs with other meta-heuristics. Using these guidelines, this research further proposes an adaptive EA/G and EA/G-GA to improve the performance of EA/G. The proposed algorithm solved the single machine scheduling problems with earliness/tardiness cost in a just-in-time scheduling environment. The experimental results indicated that the Adaptive EA/G and EA/G-GA outperform ACGA and EA/G statistically significant with different stopping criteria. When it comes to the intensification of EDAs, heuristic method is combined with EDAs. Because NEH is a well-known heuristic in solving permutation flowshop problems with the objective of makespan, this heuristic generates a good initial solution for EDAs. The experimental results also indicate NEH improving the EDAs significantly. This Shih-Hsin Chen Department of Electronic Commerce Management, Nanhua University, Taiwan R.O.C. E-mail: [email protected] Min-Chih Chen Institute of Manufacturing Engineering, National Cheng Kung University, Taiwan R.O.C. E-mail: [email protected] Pei-Chann Chang Department of Information Management, Yuan-Ze University, Taiwan R.O.C. E-mail: [email protected] Qingfu Zhang Department of Computing and Electronic Systems, University of Essex, U.K. E-mail: [email protected] Yuh-Min Chen Institute of Manufacturing Engineering, National Cheng Kung University, Taiwan R.O.C. E-mail: [email protected] Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2009) 10-12 August 2009, Dublin, Ireland

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Development of a Set of Algorithms for the Multi-Project Scheduling Problems

In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a collection of operations and there is a due da...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine

Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

A fast estimation of distribution algorithm for dynamic fuzzy flexible job-shop scheduling problem

Due to the complicated circumstances in workshop, most of the conventional scheduling algorithms fail to meet the requirements of instantaneity, complexity, and dynamicity in job-shop scheduling problems. Compared with the static algorithms, dynamic scheduling algorithms can better fulfill the requirements in real situations. Considering that both flexibility and fuzzy processing time are commo...

متن کامل

Optimization of a Bi-objective Scheduling for Two Groups of Experienced and Inexperienced Distribution Staff Based on Capillary Marketing

Developing an appropriate plan for distribution department is significant because of its influence on company's other costs and customers' satisfaction. In this study, a new bi-objective mix-integer linear programming model developed for scheduling two groups of experienced and inexperienced distribution staff based on capillary marketingin Pak Pasteurized Dairy Products Company of Guilan provi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009